Response Time Analysis of Two Server Fork-Join Systems
نویسندگان
چکیده
This paper gives an exact analysis of mean response time of fork-join systems. The response time is shown to be the sum of parallel wait and parallel service times which are analogous to wait and service times in non-parallel systems. It is shown that the parallel service time of a job is dependent on the state at arrival time of the job. A formal parallel wait time analysis, similar to the wait time analysis of non-parallel systems is also given. The analysis is carried out using event/time sequence (ET-S) trees, a simple modeling technique introduced in this paper.
منابع مشابه
Non-Asymptotic Delay Bounds for Multi-Server Systems with Synchronization Constraints
Multi-server systems have received increasing attention with important implementations such as Google MapReduce, Hadoop, and Spark. Common to these systems are a fork operation, where jobs are first divided into tasks that are processed in parallel, and a later join operation, where completed tasks wait until the results of all tasks of a job can be combined and the job leaves the system. The s...
متن کاملThe M/M/1 Fork-Join Queue with Variable Sub-Tasks
The fork-join queue models parallel resources where arriving jobs divide into various number of sub-tasks that are assigned to unique devices within the parallel resource. Each device in the parallel resource is modeled by M=M=1 queueing servers. A job completes execution and departs the parallel resource after all its sub-tasks complete execution. This paper analyzes N-server fork-join queues ...
متن کاملComputing Performance Bounds for Fork-Join Queueing Models
We study a computer system which accepts parallel programs which can be modeled using the fork-join computational paradigm. The system under study has K homogeneous servers, each having an in nite capacity queue. Jobs arrive to the system according to a general interarrival process with mean arrival rate . Upon arrival, the job is split into K independent tasks ti; 1 i K and task ti is assigned...
متن کاملReduction of Subtask Dispersion in Fork-Join Systems
Fork-join and split-merge queueing systems are well-known abstractions of parallel systems in which each incoming task splits into subtasks that are processed by a set of parallel servers. A task exits the system when all of its subtasks have completed service. Two key metrics of interest in such systems are task response time and subtask dispersion. This paper presents a technique applicable t...
متن کاملReducing subtask dispersion in parallel queueing systems
In various real-world parallel processing systems, incoming tasks divide into several subtasks that are processed independently by parallel servers. Queueing networks are a natural way to represent the ow and processing of tasks and subtasks in such systems. Two useful classes of queueing network representations are split-merge and fork-join systems. There are two main metrics of interest in th...
متن کامل